Link Prediction Using Top-k Shortest Distances
نویسندگان
چکیده
In this paper, we apply an efficient top-k shortest distance routing algorithm to the link prediction problem and test its efficacy. We compare the results with other base line and state-of-the-art methods as well as with the shortest path. Our results show that using top-k distances as a similarity measure outperforms classical similarity measures such as Jaccard and Adamic/Adar.
منابع مشابه
Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling
We propose an indexing scheme for top-k shortestpath distance queries on graphs, which is useful in a wide range of important applications such as networkaware searches and link prediction. While many efficient methods for answering standard (top-1) distance queries have been developed, none of these methods are directly extensible to top-k distance queries. We develop a new framework for top-k...
متن کاملFinding Top-k Shortest Path Distance Changes in an Evolutionary Network
Networks can be represented as evolutionary graphs in a variety of spatio-temporal applications. Changes in the nodes and edges over time may also result in corresponding changes in structural garph properties such as shortest path distances. In this paper, we study the problem of detecting the top-k most significant shortest-path distance changes between two snapshots of an evolving graph. Whi...
متن کاملMin-Link Shortest Path Maps and Fréchet Distance
We present shortest path maps that support min-link queries from any source point on a line segment to destination points in either a simple polygon or a polygonal domain (a polygon with holes). These structures are more versatile than the traditional shortest path map from a fixed source point, and we use them to compute the min-link Fréchet distance between two polygonal curves. In addition t...
متن کاملLink Prediction using Network Embedding based on Global Similarity
Background: The link prediction issue is one of the most widely used problems in complex network analysis. Link prediction requires knowing the background of previous link connections and combining them with available information. The link prediction local approaches with node structure objectives are fast in case of speed but are not accurate enough. On the other hand, the global link predicti...
متن کاملA decremental approach with the A⁄ algorithm for speeding-up the optimization process in dynamic shortest path problems
Dynamic (time-dependent) network routing has become important due to the deployment of advanced traveler information systems in navigation systems. We study the problem of speeding-up the shortest path in continuous-time dynamic networks without a priori knowledge of the link travel times. We apply the A⁄ algorithm using the decremental approach to reduce the network size and speed-up the optim...
متن کامل